METAHEURISTIC ALGORITHMS. METAPHORS-STRATEGIES (REVIEW ARTICLE)

نویسندگان

چکیده

The relevance of modern metaheuristic algorithms, clarification a number terms and relationships between them, the need for classification, as well metaphors used to describe algorithms are described. This makes it possible understand cover specified topic conduct research on literary sources related issue. A categories their interrelationships were considered, which made propose classification algorithms. An approach based division taken from natural sciences is proposed. According names classes, filling takes place. combine certain segment knowledge into cluster with single terminology. Considering category "metaphor" its functions in formation gain deeper understanding possibilities using scientific activity form list requirements them when describing overview interesting, original diverse was conducted, trends this issue, determine advantages disadvantages shape role metaphor or description. Also, review distinguish two intellectual directions metaphors: helping increase intensifying delivery idea target audience an already developed algorithm strategy development new strategies finding optimal parameters. system design considered. triangle "idea-algorithm-metaphor" has been formed, ways system, allows developer define choose path subsequent stages. Keywords: algorithm, metaphor, optimization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms

Fuzzy clustering is a famous unsupervised learning method used to collecting similar data elements within cluster according to some similarity measurement. But, clustering algorithms suffer from some drawbacks. Among the main weakness including, selecting the initial cluster centres and the appropriate clusters number is normally unknown. These weaknesses are considered the most challenging tas...

متن کامل

Familial adenomatous polyposis, diagnosis and surveillance strategies: review article

Familial adenomatous polyposis is characterized by over 100 colorectal adenomas in the colorectum. The disease equally affects both sexes, with an incidence estimated at 1.14025-1.8300. The disease is premature in people with familial adenomatous polyposis. Patients suffering from familial adenomatous polyposis have a range of extra-intestinal diseases such as papillae, gastric, small intestine...

متن کامل

METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

متن کامل

STRUCTURAL RELIABILITY ASSESSMENT UTILIZING FOUR METAHEURISTIC ALGORITHMS

The failure probability of the structures is one of the challenging problems in structural engineering. To obtain the reliability index introduced by Hasofer and Lind, one needs to solve a nonlinear equality constrained optimization problem. In this study, four of the most recent metaheuristic algorithms are utilized for finding the design point and the failure probability of problems with cont...

متن کامل

Quantile Regression using Metaheuristic Algorithms

This paper demonstrates that metaheuristic algorithms can provide a useful general framework for estimating both linear and nonlinear econometric models. Two metaheuristic algorithms—firefly and accelerated particle swarm optimization—are employed in the context of several quantile regression models. The algorithms are stable and robust to the choice of starting values and the presence of vario...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Vestnik Nacional?nogo tehni?eskogo universiteta "HPI"

سال: 2023

ISSN: ['2079-0775']

DOI: https://doi.org/10.20998/2079-0775.2023.1.01